Coarse-Grain RNA Folding: Towards More Complex Structures
نویسندگان
چکیده
منابع مشابه
Coarse-Grained Prediction of RNA Loop Structures
One of the key issues in the theoretical prediction of RNA folding is the prediction of loop structure from the sequence. RNA loop free energies are dependent on the loop sequence content. However, most current models account only for the loop length-dependence. The previously developed "Vfold" model (a coarse-grained RNA folding model) provides an effective method to generate the complete ense...
متن کاملCoarse-grained model for predicting RNA folding thermodynamics.
We present a thermodynamically robust coarse-grained model to simulate folding of RNA in monovalent salt solutions. The model includes stacking, hydrogen bond, and electrostatic interactions as fundamental components in describing the stability of RNA structures. The stacking interactions are parametrized using a set of nucleotide-specific parameters, which were calibrated against the thermodyn...
متن کاملExact Folding Dynamics of RNA Secondary Structures
Barrier trees consisting of local minima and their connecting saddle points imply a natural coarse-graining for the description of the energy landscape of RNA secondary structures. Here we show that, based on this approach, it is possible to predict the folding behavior of RNA molecules by numerical integration. Comparison with stochastic folding simulations shows reasonable agreement of the re...
متن کاملFolding 3-Noncrossing RNA Pseudoknot Structures
In this article, we present the novel ab initio folding algorithm cross, which generates minimum free energy (mfe), 3-noncrossing, canonical RNA structures. Here an RNA structure is 3-noncrossing if it does not contain three or more mutually crossing arcs and canonical, if each of its stacks has size greater or equal than two. Our notion of mfe-structure is based on a specific concept of pseudo...
متن کاملComputing folding pathways between RNA secondary structures
Given an RNA sequence and two designated secondary structures A, B, we describe a new algorithm that computes a nearly optimal folding pathway from A to B. The algorithm, RNAtabupath, employs a tabu semi-greedy heuristic, known to be an effective search strategy in combinatorial optimization. Folding pathways, sometimes called routes or trajectories, are computed by RNAtabupath in a fraction of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2014
ISSN: 0006-3495
DOI: 10.1016/j.bpj.2013.11.1662